NEW HIDING TECHNIQUE IN DIGITAL SIGNATURE BASED ON ZIGZAG TRANSFORM AND CHAOTIC MAPS

Abstract This paper presents a novel approach to digital signature by integrating the ElGamal or Schnorr digital signature algorithms, chaotic systems, and scanning techniques. Briefly, ZZBCRP is a zigzag transformation that is used firstly to construct a permuted transaction, which technique starts from any random position and intersects in both directions, which is more complex than zigzag transform techniques. Then using ElGamal or Schnorr signature schemes based on chaotic maps. This modification aims to make private key and random number dependent on discrete chaotic maps. Even if the private key chosen is small, it is easy by using the huge amount of points in chaotic maps 2-D or 3-D to extract strong and unique key. This change complicates the relationship between the private key, public key and the transaction signature. A two-dimensional trigonometric discrete chaotic map is used that integrated Logistic-sine-cosine maps, and a three-dimensional hyperchaotic map (3-D SCC) which are based on a sine map. Our performance analysis shows that compared to schemes; this scheme not only improves the level of efficiency but also assures safety. The performance analysis shows that our scheme is not only more efficient compared to other related systems, but also safer

A novel model for representing a plane target and finding the worst-case coverage in wireless sensor network based on Clifford algebra

Abstract Wireless ad hoc sensor networks have recently emerged as a premier research topic. They have great long-term economic potential and ability to transform our lives and pose many new system building challenges. Sensor networks also pose a number of new conceptual and optimization problems. Most of researches in wireless sensor networks are focused in obtaining better target coverage in order to reduce energy and cost of the network. The problem of planar target analysis is one of the crucial problems that should be considered while studying coverage problem of sensor networks. By combining computational geometry and graph theoretic techniques, specifically the Voronoi diagram and graph search algorithms, this paper introduces a novel sensor network coverage model that deals with plane target problem based on Clifford algebra which is a powerful tool that is coordinate free. Also, the calculations of the node coverage rate for the plane target in the sensor network using Clifford algebra are presented. Then, the maximum clearance path (worst-case coverage) of the sensor network for a plane target is proposed. The optimality and reliability of the proposed algorithm have been proved using simulation. Also, a comparison between the breach weight of the point target and the plane target is provided

A Novel Dynamic Mathematical Model Applied in Hash Function Based on DNA Algorithm and Chaotic Maps

This paper aims to improve SHA-512 security without increasing complexity; therefore, we focused on hash functions depending on DNA sequences and chaotic maps. After analysis of 45 various chaotic map types, only 5 types are selected in this proposal—namely, improved logistic, cosine logistic map, logistic sine system, tent sine system, and hybrid. Using DNA features and binary coding technology with complementary rules to hide information is a key challenge. This article proposes improving SHA-512 in two aspects: the modification of original hash buffer values, and the modification of additive constants Kt. This proposal is to make hash buffer values (a, b, c, d, e, f, g, and h) and Kt dependent on one-dimensional discrete chaotic maps and DNA sequences instead of constant. This modification complicates the relationship between the original message and hash value, making it unexpected. The performance of the proposed hash function is tested and analyzed the confusion, diffusion, and distributive and compared with the original SHA-512. The performance of security is analyzed by collision analysis, for which the maximum number of hits is only three, showing that the proposed hash function enhances the security and robustness of SHA-512. The statistical data and experimental analysis indicate that the proposed scheme has good properties and satisfies high-performance requirements for secure hash functions

QuiTRU: Design Secure Variant of Ntruencrypt Via a New Multi-Dimensional Algebra

The NTRU public-key cryptosystem is based on time complexity and efficient computations. Many researchers were stimulated to improve NTRU performance by changing mathematical structure with new algebraic structures and replacing the truncated polynomial ring, such as OTRU, QTRU. In this paper, we proposed QuiTRU as a new version of the NTRU. It’s a five-dimensional cryptosystem based on a new algebraic structure. As well, QuiTRU was compared with NTRU, QTRU, and OTRU. Keywords

Design and Analysis of New Version of Cryptographic Hash Function Based on Improved Chaotic Maps With Induced DNA Sequences

One of the first and most used hashing algorithms in blockchains is SHA-256 so the main aim of this paper is how to increase the security level of the blockchain based on the increasing hashing algorithm security. This paper proposes to present a modified SHA-256 like hash algorithm by exploring the design principles of the two hash schemes (SHA-256 and RIPEMD-160). To retrieve the increased security in the proposed algorithm, we modify the SHA-256 after the public key generation. The proposed modification is based on four different chosen types of chaotic maps and DNA sequences which eventually complicate the association between the original message and hash digest i.e., maximizing the security level, and minimizing its vulnerabilities. The proposed hash function efficiency is practically assessed, analyzed, and compared with the well-known SHA-256 with respect to the main properties of the confusion, diffusion and distribution. The security performance is also analyzed using the analysis of collision, which reveals that the new constructed hash function improves SHA-256 with respect to the security and robustness. From the experimental analyses results, the proposed modified hash scheme found to exhibit the better security performance than many state-of-the art existing hash function schemes